Correlated Pseudorandomness from Expand-Accumulate Codes

نویسندگان

چکیده

A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful sources of correlated randomness, such as random oblivious transfers (OT) and vector linear evaluations (VOLE), with low communication cost. We introduce simple new design PCGs based on so-called expand-accumulate codes, which first apply sparse expander graph to replicate each message entry, then accumulate the entries by computing sum prefix. Our offers following advantages compared state-of-the-art PCG constructions: To further improve concrete computational cost, we propose method speeding up full-domain evaluation puncturable function (PPRF). This independently motivated other cryptographic applications PPRFs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Obtaining Pseudorandomness from Error-Correcting Codes

Constructing pseudorandom objects based on codes has been the focus of some recent research. These constructions were based on specific algebraic codes and were rather simple in their structure in that a random index into a codeword was picked and m subsequent symbols output. In this work, we explore the question of whether it is possible to extend the scope of application of this paradigm of c...

متن کامل

Repeat-Accumulate Signal Codes

We propose a new state-constrained signal code, namely repeat-accumulate signal code (RASC). The original state-constrained signal code directly encodes modulation signals by signal processing filters, the filter coefficients of which are constrained over Eisenstein rings. Although the performance of signal codes is defined by signal filters, optimum filters were found by brute-force search in ...

متن کامل

Irregular Repeat – Accumulate Codes

In this paper we will introduce an ensemble of codes called irregular repeat-accumulate (IRA) codes. IRA codes are a generalization of the repeat-accumluate codes introduced in [1], and as such have a natural linear-time encoding algorithm. We shall prove that on the binary erasure channel, IRA codes can be decoded reliably in linear time, using iterative sum-product decoding, at rates arbitrar...

متن کامل

Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity

The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexi...

متن کامل

Distributed Joint Source-Channel Coding for Correlated Sources Using Non-systematic Repeat-Accumulate Based Codes

In this paper, we propose a technique for coding the data from multiple correlated binary sources, with the aim of providing an alternative solution to the correlated source compression problem. Using non-systematic repeat-accumulate based codes, it is possible to achieve compression which is close to the Slepian–Wolf bound without relying on massive puncturing. With the technique proposed in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-15979-4_21